Understanding Resolution Proofs through Herbrand’s Theorem
Identifieur interne : 001457 ( Main/Exploration ); précédent : 001456; suivant : 001458Understanding Resolution Proofs through Herbrand’s Theorem
Auteurs : Stefan Hetzl [Autriche] ; Tomer Libal [France] ; Martin Riener [Autriche] ; Mikheil Rukhaia [France]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: Computer-generated proofs are usually difficult to grasp for a human reader. In this paper we present an approach to understanding resolution proofs through Herbrand’s theorem and the implementation of a tool based on that approach. The information we take as primitive is which instances have been chosen for which quantifiers, in other words: an expansion tree. After computing an expansion tree from a resolution refutation, the user is presented this information in a graphical user interface that allows flexible folding and unfolding of parts of the proof. This interface provides a convenient way to focus on the relevant parts of a computer-generated proof. In this paper, we describe the proof-theoretic transformations, the implementation and demonstrate its usefulness on several examples.
Url:
DOI: 10.1007/978-3-642-40537-2_15
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001A42
- to stream Istex, to step Curation: 001A22
- to stream Istex, to step Checkpoint: 000083
- to stream Main, to step Merge: 001469
- to stream Main, to step Curation: 001457
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Understanding Resolution Proofs through Herbrand’s Theorem</title><author><name sortKey="Hetzl, Stefan" sort="Hetzl, Stefan" uniqKey="Hetzl S" first="Stefan" last="Hetzl">Stefan Hetzl</name></author><author><name sortKey="Libal, Tomer" sort="Libal, Tomer" uniqKey="Libal T" first="Tomer" last="Libal">Tomer Libal</name></author><author><name sortKey="Riener, Martin" sort="Riener, Martin" uniqKey="Riener M" first="Martin" last="Riener">Martin Riener</name></author><author><name sortKey="Rukhaia, Mikheil" sort="Rukhaia, Mikheil" uniqKey="Rukhaia M" first="Mikheil" last="Rukhaia">Mikheil Rukhaia</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:7259FE09E7F59C6B0DCF54A8AD601520931B52C0</idno><date when="2013" year="2013">2013</date><idno type="doi">10.1007/978-3-642-40537-2_15</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-LJ6L3WLK-2/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">001A42</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001A42</idno><idno type="wicri:Area/Istex/Curation">001A22</idno><idno type="wicri:Area/Istex/Checkpoint">000083</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000083</idno><idno type="wicri:doubleKey">0302-9743:2013:Hetzl S:understanding:resolution:proofs</idno><idno type="wicri:Area/Main/Merge">001469</idno><idno type="wicri:Area/Main/Curation">001457</idno><idno type="wicri:Area/Main/Exploration">001457</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Understanding Resolution Proofs through Herbrand’s Theorem</title><author><name sortKey="Hetzl, Stefan" sort="Hetzl, Stefan" uniqKey="Hetzl S" first="Stefan" last="Hetzl">Stefan Hetzl</name><affiliation wicri:level="1"><country xml:lang="fr">Autriche</country><wicri:regionArea>Institute of Discrete Mathematics and Geometry, Vienna University of Technology</wicri:regionArea><wicri:noRegion>Vienna University of Technology</wicri:noRegion></affiliation></author><author><name sortKey="Libal, Tomer" sort="Libal, Tomer" uniqKey="Libal T" first="Tomer" last="Libal">Tomer Libal</name><affiliation wicri:level="1"><country xml:lang="fr">France</country><wicri:regionArea>Microsoft Research - Inria Joint Center, École Polytechnique</wicri:regionArea><wicri:noRegion>École Polytechnique</wicri:noRegion><wicri:noRegion>École Polytechnique</wicri:noRegion></affiliation></author><author><name sortKey="Riener, Martin" sort="Riener, Martin" uniqKey="Riener M" first="Martin" last="Riener">Martin Riener</name><affiliation wicri:level="1"><country xml:lang="fr">Autriche</country><wicri:regionArea>Institute of Computer Languages, Vienna University of Technology</wicri:regionArea><wicri:noRegion>Vienna University of Technology</wicri:noRegion></affiliation></author><author><name sortKey="Rukhaia, Mikheil" sort="Rukhaia, Mikheil" uniqKey="Rukhaia M" first="Mikheil" last="Rukhaia">Mikheil Rukhaia</name><affiliation wicri:level="1"><country xml:lang="fr">France</country><wicri:regionArea>Inria Saclay, École Polytechnique</wicri:regionArea><wicri:noRegion>École Polytechnique</wicri:noRegion><wicri:noRegion>École Polytechnique</wicri:noRegion></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: Computer-generated proofs are usually difficult to grasp for a human reader. In this paper we present an approach to understanding resolution proofs through Herbrand’s theorem and the implementation of a tool based on that approach. The information we take as primitive is which instances have been chosen for which quantifiers, in other words: an expansion tree. After computing an expansion tree from a resolution refutation, the user is presented this information in a graphical user interface that allows flexible folding and unfolding of parts of the proof. This interface provides a convenient way to focus on the relevant parts of a computer-generated proof. In this paper, we describe the proof-theoretic transformations, the implementation and demonstrate its usefulness on several examples.</div></front></TEI><affiliations><list><country><li>Autriche</li><li>France</li></country></list><tree><country name="Autriche"><noRegion><name sortKey="Hetzl, Stefan" sort="Hetzl, Stefan" uniqKey="Hetzl S" first="Stefan" last="Hetzl">Stefan Hetzl</name></noRegion><name sortKey="Riener, Martin" sort="Riener, Martin" uniqKey="Riener M" first="Martin" last="Riener">Martin Riener</name></country><country name="France"><noRegion><name sortKey="Libal, Tomer" sort="Libal, Tomer" uniqKey="Libal T" first="Tomer" last="Libal">Tomer Libal</name></noRegion><name sortKey="Rukhaia, Mikheil" sort="Rukhaia, Mikheil" uniqKey="Rukhaia M" first="Mikheil" last="Rukhaia">Mikheil Rukhaia</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001457 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 001457 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:7259FE09E7F59C6B0DCF54A8AD601520931B52C0
|texte= Understanding Resolution Proofs through Herbrand’s Theorem
}}
| This area was generated with Dilib version V0.6.33. |  |